Nuprl Lemma : generic-non-empty 11,40

T:Type{i}, S:((T){i'}). T  generic{i:l}(Tf.S(f))  (f:TS(f)) 
latex


Definitions, x:AB(x), f(a), x(s), x:A  B(x), x:AB(x), x:AB(x), P & Q, Generic{f:T|S(f)}, Type, t  T, , xt(x), P  Q, l[i], s = t, ||as||, #$n, {i..j}, type List, a < b, n+m, l1  l2, A  B, Void, False, A, , {x:AB(x)} , i  j < k, [], [car / cdr], as @ bs, t.1, i <z j, if b then t else f fi , x.A(x), primrec(n;b;c), True, i j, b, b, , T, P  Q, P  Q, Unit, left + right, (i = j), {T}, SQType(T), s ~ t, n - m, i  j , -n, P  Q, Dec(P), A c B
Lemmasiseg select, decidable le, decidable int equal, select wf, length append, length wf2, iseg length, ge wf, nat properties, iseg transitivity, iseg append, iseg weakening, assert of bnot, not functionality wrt iff, assert of eq int, eq int wf, not wf, eqtt to assert, assert of lt int, iff transitivity, eqff to assert, squash wf, true wf, bnot of lt int, assert of le int, bool wf, bnot wf, assert wf, le int wf, primrec wf, ifthenelse wf, lt int wf, pi1 wf, append wf, int seg wf, iseg wf, length wf1, le wf, generic wf, nat wf

origin